Copula‐based robust optimal block designs
نویسندگان
چکیده
منابع مشابه
Optimal Incomplete Block Designs
Optimal incomplete block designs are pursued through the E-criterion of minimizing maximal variance. Methodology is developed for design choice based on graphs and an extensive catalog of downloadable designs compiled. Along with the general methodology, a near complete solution for E-optimal block designs is provided for up to 15 treatments. E-optimality is revealed as a flexible criterion tha...
متن کاملOptimal Cylindrical-block Designs for Correlated Observations
This paper addresses the problem of characterizations and constructions of optimal and efficient two-dimensional designs for generalized least squares estimation of treatment contrasts when the errors are correlated. Universally optimal designs are obtained when the plots of each block are on a cylinder and the errors follow the three parameter autonormal process on the cylinder. Efficiencies o...
متن کاملRobust Optimal Designs with Reduced Curvature
Researchers often find that nonlinear regression models are more relevant for their studies than are linear ones, and are thus often in a position of requiring efficient designs for a given nonlinear model. A common shortcoming of most optimal designs for nonlinear models used in practical settings, however, is that these designs typically focus only on first-order parameter variance or predict...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملOptimal combinatorial batch codes based on block designs
Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai, represent the distributed storage of an n-element data set on m servers in such a way that any batch of k data items can be retrieved by reading at most one (or more generally, t) items from each server, while keeping the total storage over m servers equal to N . This paper considers a class of batch codes (for t = 1), called c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Stochastic Models in Business and Industry
سال: 2019
ISSN: 1524-1904,1526-4025
DOI: 10.1002/asmb.2469